Empirical Data Sets are Algorithmically Compressible: Reply to McAllister ?

نویسندگان

  • Charles Twardy
  • Steve Gardner
چکیده

James McAllister’s 2003 article, “Algorithmic randomness in empirical data” claims that empirical data sets are algorithmically random, and hence incompressible. We show that this claim is mistaken. We present theoretical arguments and empirical evidence for compressibility, and discuss the matter in the framework of Minimum Message Length (MML) inference, which shows that the theory which best compresses the data is the one with highest posterior probability, and the best explanation of the data.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

What do patterns in empirical data tell us about the structure of the world?

1. Any empirical data set can in principle be decomposed into a pattern and a remainder or noise term in any one of infinitely many different ways. 2. At least some patterns in which an empirical data set can be decomposed constitute evidence that the world has a particular structure. 3. All evidence that the world has a particular structure takes the form of one or more patterns in empirical d...

متن کامل

Numerical Simulation of Turbulent Subsonic Compressible Flow through Rectangular Microchannel

In this study, turbulent compressible gas flow in a rectangular micro-channel is numerically investigated. The gas flow assumed to be in the subsonic regime up to Mach number about 0.7. Five low and high Reynolds number RANS turbulence models are used for modeling the turbulent flow. Two types of mesh are generated depending on the employed turbulence model. The computations are performed for R...

متن کامل

Under Physics-Motivated Constraints, Generally-Non-Algorithmic Computational Problems become Algorithmically Solvable

It is well known that many computational problems are, in general, not algorithmically solvable: e.g., it is not possible to algorithmically decide whether two computable real numbers are equal, and it is not possible to compute the roots of a computable function. We propose to constraint such operations to certain “sets of typical elements” or “sets of random elements”. In our previous papers,...

متن کامل

A committee machine approach for predicting permeability from well log data: a case study from a heterogeneous carbonate reservoir, Balal oil Field, Persian Gulf

Permeability prediction problem has been examined using several methods such as empirical formulas, regression analysis and intelligent systems especially neural networks and fuzzy logic. This study proposes an improved and novel model for predicting permeability from conventional well log data. The methodology is integration of empirical formulas, multiple regression and neuro-fuzzy in a commi...

متن کامل

Diophantine properties of brownian motion: recursive aspects

We use recent results on the Fourier analysis of the zero sets of Brownian motion to explore the diophantine properties of an algorithmically random Brownian motion ( also known as a complex oscillation). We discuss the construction and definability of perfect sets which are linearly independent over the rationals directly from Martin-Löf random reals. Finally we explore the recent work of Tsir...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004